Square Designs on New Binary ( 3 n − 1 2 , 3 n − 1 2 , 2 . 3 n − 2 ) Codes
نویسندگان
چکیده
C is an (n,M, d)q code over Fq of length n with M codewords and minimum distance d. The code C can be either linear or nonlinear. A t − (v, k, λ) design D is a set X of v points together with a collection of k−subsets of X (called block) such that every t−subset of X is contained in exactly λ blocks. In this paper a new binary code ( n−1 2 , 3n−1 2 , 2.3 n−2), n ≥ 3 is developed. Some properties of this code are stated. It is also shown that this code holds 2− (3−1 2 , 3n−1, 2.3n−2) design.
منابع مشابه
All binary linear codes that are invariant under PSL2(n)
The projective special linear group PSL2(n) is 2-transitive for all primes n and 3-homogeneous for n≡ 3 (mod 4) on the set {0,1, · · · ,n−1,∞}. It is known that the extended odd-like quadratic residue codes are invariant under PSL2(n). Hence, the extended quadratic residue codes hold an infinite family of 2-designs for primes n≡ 1 (mod 4), an infinite family of 3-designs for primes n≡ 3 (mod 4)...
متن کاملGraphs, designs and codes related to the n-cube
For integers n ≥ 1, k ≥ 0, and k ≤ n, the graph Γn has vertices the 2 vectors of F n 2 and adjacency defined by two vectors being adjacent if they differ in k coordinate positions. In particular Γn is the n-cube, usually denoted by Qn. We examine the binary codes obtained from the adjacency matrices of these graphs when k = 1, 2, 3, following results obtained for the binary codes of the n-cube ...
متن کاملA New Construction of Quantum Error-correcting Codes
In this paper, we present a characterization of (binary and nonbinary) quantum error-correcting codes. Based on this characterization, we introduce a method to construct p-ary quantum codes using Boolean functions satisfying a system of certain quadratic relations. As a consequence of the construction, we are able to construct quantum codes of minimum distance 2. In particular, we produce a cla...
متن کاملOn new completely regular q-ary codes
In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...
متن کاملOptimal Constant Weight Codes
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denot...
متن کامل